A makespan minimization problem for versatile developers in the game industry

the algorithm for solving the inverse numerical range problem

برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.

Makespan minimization of a flowshop sequence-dependent group scheduling problem

The flowshop sequence dependent group scheduling problem with minimization of makespan as the objective (Fm|fmls, Splk, prmu|Cmax) is considered in this paper. It is assumed that several groups with different number of jobs are assigned to a flow shop cell that has m machines. The goal is to find the best sequence of processing the jobs in each group and the groups themselves with minimization ...

A modified LPT algorithm for the two uniform parallel machine makespan minimization problem

We propose a modified longest processing time (MLPT) heuristic algorithm for the two uniform machine makespan minimization problem. The MLPT algorithm schedules the three longest jobs optimally first, followed by the remaining jobs sequenced according to the LPT rule. We prove the tight worst-case ratio bound of ffiffiffiffiffiffi 1:5 p 1⁄4 1:2247 for the MLPT algorithm which is an improvement ...

Makespan Minimization for a Two-Machine Scheduling Problem with a Single Server

We consider the following problem. A set of non-preemptable jobs has to be scheduled on two identical parallel machines such that the makespan is minimized. Before processing, each job must be loaded on a machine, which takes a given setup time. All these setups have to be done by a single server which can handle at most one job at a time. For this problem, we propose three mixed integer linear...

Makespan Minimization for a Parallel Machine Scheduling Problem with Preemption and Job Incompatibility